-
1 satisfiability problem
проблема выполнимости
Термин булевой алгебры, определяет, какое значение 1 или 0 надо добавить к выражению, чтобы выражение равнялось 1. Это - труднорешаемая задача.
[ http://www.morepc.ru/dict/]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > satisfiability problem
-
2 satisfiability problem
Большой англо-русский и русско-английский словарь > satisfiability problem
-
3 satisfiability problem
1) Математика: задача выполнимости2) Вычислительная техника: проблема выполнимости, проблема выполнимости (в булевой алгебре)Универсальный англо-русский словарь > satisfiability problem
-
4 satisfiability problem
вчт задача о возможности выполнения всех условийEnglish-Russian electronics dictionary > satisfiability problem
-
5 satisfiability problem
вчт. задача о возможности выполнения всех условийThe New English-Russian Dictionary of Radio-electronics > satisfiability problem
-
6 satisfiability problem
English-Russian dictionary of computer science and programming > satisfiability problem
-
7 satisfiability problem
English-Russian scientific dictionary > satisfiability problem
-
8 satisfiability problem
English-Russian information technology > satisfiability problem
-
9 restricted satisfiability problem
Программирование: ограниченная проблема выполнимостиУниверсальный англо-русский словарь > restricted satisfiability problem
-
10 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
11 problem
задача; проблема- accounting problem
- allocation problem
- assignment problem
- ballot problem
- benchmark problem
- blending problem
- bottleneck problem
- boundary-value problem
- boundary problem
- business problem
- Byzantine Generals problem
- center problem
- check problem
- chess problem
- commonly encountered problem
- computational problem
- continuum problem
- covering problem
- data problem
- data-set problem
- daunting problem
- decision problem
- deducibility problem
- design problem
- dining philosophers' problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- estimation problem
- EVA problem
- extremely ill-conditioned problem
- fault-location problem
- filtering problem
- findpath problem
- finger-pointing problem
- flow problem
- frame problem
- free-boundary problem
- game-theory problem
- game problem
- graph theoretic problem
- graphics problem
- ill-conditioned problem
- ill-defined problem
- ill-posed problem
- inference problem
- information retrieval problem
- initial value problem
- intractable problem
- job-shop problem
- knapsack problem
- Konigsberg bridge problem
- labyrinth problem
- location problem
- logical problem
- management problem
- market analysis problem
- marriage problem
- maximum flow problem
- maximum network flow problem
- mildly ill-posed problem
- minimal connector problem
- model problem
- multivariate problem
- newspaper-boy problem
- ninety percent complete problem
- nominal design problem
- off-by-one problem
- omelet problem
- one-sample problem
- postman problem
- programming problem
- projection problem
- pursuit problem
- quadratic assignment problem
- queuing problem
- race problem
- ramification problem
- real-time problem
- real-world problem
- reducibility problem
- resource allocation problem
- routing problem
- ruin problem
- satisfiability problem
- scheduling problem
- search problem
- severely ill-posed problem
- shortest route problem
- simulated problem
- software problem
- sparse problem
- stale data problem
- stochastic problem
- switchbox routing problem
- switchbox problem
- target assignment problem
- test problem
- three-dimensional problem
- time transportation problem
- trade-off problem
- traffic problem
- transport problem
- transportation problem
- traveling salesman problem
- trouble-location problem
- troubleshooting problem
- unconstrained problem
- undecidable problem
- underdetermined problem
- unsolvable problem
- unstructured problem
- variational problem
- vessel loading problem
- waiting line problem
- weak bridge problem
- well-behaved problem
- well-defined problem
- well-posed problemEnglish-Russian dictionary of computer science and programming > problem
-
12 problem
1) проблема; задача2) проблемный3) вчт прикладной ( о программе или программисте)•- AI-complete problem
- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue problem
- eigenvalue assignment problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P-problem
- polynomial time problem
- Post problem
- Post correspondence problem
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problem -
13 problem
1) проблема; задача2) проблемный3) вчт. прикладной ( о программе или программисте)•- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- nondeterministic polynomial time problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P problem
- polynomial time problem
- Post correspondence problem
- Post problem
- problem of allocation
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problemThe New English-Russian Dictionary of Radio-electronics > problem
-
14 проблема выполнимости
Большой англо-русский и русско-английский словарь > проблема выполнимости
-
15 задача выполнимости
Большой англо-русский и русско-английский словарь > задача выполнимости
См. также в других словарях:
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Maximum satisfiability problem — In computational complexity theory, the Maximum Satisfiability problem (MAX SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by some assignment. It is an FNP generalization of SAT … Wikipedia
Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… … Wikipedia
Satisfiability — Das Erfüllbarkeitsproblem der Aussagenlogik (SAT, von engl. satisfiability) ist ein Entscheidungsproblem. Es fragt, ob eine aussagenlogische Formel erfüllbar ist. Anwendungen finden sich unter anderem in der Komplexitätstheorie, Verifikation und… … Deutsch Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Horn-satisfiability — In formal logic, Horn satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable.A Horn clause is a clause with at most one positive literal, called the head of the clause, and any… … Wikipedia
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia